Information integration method for decision regulation in hierarchic decision systems

ABSTRACT

A decision regulation method separates noise from consistent application domain characteristics and integrates multiple types of information to create robust decisions that work well for the application in spite of the application dynamics and/or errors in training data. Adjustment is made between a local and global decision basis to yield a balance point to match the application. Unequal class prevalence of the training data is compensated. The decision tree generation process is also regulated using information integration. Reliability measures and new pruning methods are taught for optimization of hierarchical decision structures.

TECHNICAL FIELD

[0001] This invention relates to information integration for regulating hierarchic decision systems.

BACKGROUND OF THE INVENTION

[0002] Many decision system applications such as data mining, automatic process control, automatic target recognition, intelligent search, and machine vision perform decision making using rules derived from offline training or online learning. Decision rules encapsulate the knowledge acquired from the application and transform it into recipes to make decisions on new data. Decision rules are responsive to the training data used to create them. However, they do not necessarily yield robust performance in the application they were intended to service. General decision rules that are domain independent generally do not perform well. Yet, expert systems that are highly domain specific are frequently not robust to changes and variations.

[0003] Many prior art approaches can be used for decision rule generation. These include knowledge acquisition methods in expert systems, statistical discriminate analysis, Bayesian decision theory, Bayesian belief networks, fuzzy systems, artificial neural networks, genetic algorithms, etc. Several of the approaches are capable of generating complicated rules to optimize decisions for the training data and yield superior re-substitution (test on training data) results.

[0004] In simple applications, almost all the above referenced prior art approaches could result in reasonable performance. However, due to the dynamic nature of many applications, unforeseen conditions or data are often encountered in the field that challenge the decision rules created without the benefits of the new information. Furthermore, errors in the training database can be very common due to incorrect data entry, mislabels, incorrect truth, or measurement errors. Decision rules specifically optimized for the training data may fail on the new data due to dynamic application situations or training data errors. Thus, they frequently lack robustness.

[0005] To overcome the difficulty of non-robust performance, prior art methods divide available data into training and testing sets. They use the training set to generate decision rules and use the test set to assess and guide the decision rule generation process from the training. This approach can improve the robustness of the decision rules. However, it is inefficient since it generates decision rules from only partial data and it fails to utilize all data within small training data sets, giving rise to the condition of insufficient training. Furthermore, they cannot effectively deal with outliers created by errors in the training database.

[0006] The decision tree is a popular prior art decision approach. It makes decisions through a hierarchical decision procedure that implements a divide-and-conquer strategy. Prior art decision tree classifiers address the robustness problem using a pruning scheme (J. H., Olshen R. A. and Stone C. J., “Classification And Regression Trees”, Chapman & Hall/CRC, 1984, pp 59-62; Quinlan J. R., “C4.5 Programs For Machine Learning”, Morgan Kaufmann, 1993, pp 35-43; John H. George “Robust Decision Trees: Removing Outliers from Databases”, in Proceedings of the First International Conference on Knowledge Discovery and Data Mining, Fayyad and Uthurusamy Eds, AAAI Press, PP. 174-179, 1995). This was an attempt to remove the effect of outliers from the training data. However, they have not been shown to consistently achieve higher accuracy. A prior art invention (Lee Shih-Jong J. “Method for Regulation of Hierarchic Decisions in Intelligent Systems”, U.S. patent application Ser. No. 09/972,057, filed Oct. 5, 2001) regulates the decision rules to respond appropriately to uncertainty. It automatically adjusts the operating characteristic between crisp and soft decisions to match the application. It provides automatic optimization of decision rules by assessing the robustness and generalization of the decisions.

[0007] However, the above decision tree based prior art relies on local data assessment in nodes deep in the tree. The local data inherently hinders the proper separation of noise from the application domain's consistent characteristics. Local data only represents partial information of the data distribution. Local nodes with small numbers of samples could contain outliers yet in many cases they contain data bearing consistent characteristics. The discrimination between noise and real signal cannot be simply determined based on the local information. Furthermore, prior art terminal node class assignment is based on the relative counts of training samples from different classes. Unequal prevalence of training samples from different classes can significantly impact the classification result.

OBJECTS AND ADVANTAGES

[0008] This invention provides a decision regulation method that separates noise from consistent application domain characteristics and integrates multiple types of information to create robust decisions that work well for the application in spite of the application dynamics and/or errors in training data. One object of the invention is to automatically compensate for unequal class prevalence of the training data. Another object of the invention is to enable adjustment between a local and global decision basis to yield a balance point to match an application. A third object is to regulate the decision tree generation process by information integration. Still other objects are to provide reliability measures, and new pruning methods for automatic optimization of hierarchic decision structures.

[0009] Advantages include the removal of noise from the decision process and integration of local information and consistent global information for decisions. This invention automatically compensates for unequal class prevalence of the training data. This invention enables the adjustment between local and global decision basis to yield an improved decision basis to match the application. This invention integrates the available information to improve decisions and to minimize the amount and quality of training data required. This invention allows for automatic optimization of hierarchical decision structures generated from other approaches.

SUMMARY OF THE INVENTION

[0010] Incorporating global information and local information in making decisions at a node regulates decision characteristics in hierarchic decision systems. It also compensates for the prevalence difference of different training classes. This regulation method decreases noise and increases accuracy. Conventional crisp decision tree construction can realize significant improvement in robustness if the pruning process incorporates information integration of the invention. Regulated decision systems can also use integrated confidence values or reliability measures as their evaluation function when partitioning data at a node.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The preferred embodiments and other aspects of the invention will become apparent from the following detailed description of the invention when read in conjunction with the accompanying drawings which are provided for the purpose of describing embodiments of the invention and not for limiting same, in which:

[0012]FIG. 1 shows the computational structure of a typical binary decision tree classifier;

[0013]FIG. 2 shows the non-terminal node likelihood value determination process;

[0014]FIG. 3 shows the regulation tree class confidence value determination process;

DETAILED DESCRIPTION OF THE INVENTION

[0015] I. Decision Tree

[0016] A decision tree makes a decision through a hierarchical decision structure implemented as a tree. A tree consists of at least one non-terminal node and at least as many terminal nodes as the number of decision outcomes to be decided. Each outcome has associated at least one terminal node, and the non-terminal nodes represent various collections of mixed outcomes. The root node represents the entire collection of outcomes into which a new sample may be decided.

[0017] Almost all decision trees are binary decision trees where each non-terminal node branches out two descending nodes. Without loss of generality, we use binary decision tree classifiers in the descriptions of this invention. Those skilled in the art should recognize that the method of this invention is applicable to other type of decision trees or other types of parametric or non-parametric decision methods.

[0018] I.1 Binary Decision Tree Classifier

[0019]FIG. 1 shows a typical binary decision tree classifier. A binary decision tree has two descendant paths (e.g. 109, 110 for node 100) for each non-terminal node. There is a decision rule associated with each non-terminal node to determine the descendant path for a sample at the node, until a terminal node is reached. The decision outcomes of a decision tree classifier 103, 104, 105, 107, 108 are classes associated with the input data. Examples of classes include disease types, defect classifications, weather patterns, etc.

[0020] In the classification mode, an unknown sample enters the decision tree at the root node 100 and the decision rule associated with the root node 100 is applied to the sample's feature vector to determine the descendant path that the sample will follow. This process is repeated until a terminal node 117 is reached. Every terminal node has an associated class to which the sample is assigned.

[0021] The commonly used decision rule at each non-terminal node 118 is thresholding of a discrimination function value at the node. If the node's discrimination function value is less than or equal to a threshold value, the left child is taken; otherwise, the right child is taken for the descendant path. Feature thresholding is the simplest yet most easily understandable discrimination function. It selects a feature and uses its value to compare to a predetermined threshold. Other discrimination functions such as Fisher linear decision function, Bayes linear decision function, Bayes quadratic decision function and other single stage decision rules can also be used. Note that it is harder to interpret a decision tree when multiple features are involved in a discrimination function.

[0022] I.2 Binary Decision Tree Construction Procedure

[0023] Given a set of training samples, a binary decision tree can be constructed automatically by a divide and conquer procedure. All training samples are used to construct the root node. Each subsequent node is trained by a subset of the training samples. The decision tree construction procedure is as follows:

[0024] 1. For a given node n with associated training sample set U^(n), sort the samples in an ascending order according to their discrimination function values, i.e. f(X_(k)^(n)) ≤ f(X_(k + 1)^(n)).

[0025] In the case of a feature thresholding method, the sorting is performed for each of the available features. So that both feature and threshold value selection can be accomplished simultaneously.

[0026] 2. A set of candidate thresholds T^(n) is defined by: $T^{n} = \left\{ \frac{{f\left( X_{k}^{n} \right)} + {f\left( X_{k + 1}^{n} \right)}}{2} \middle| {{Class}^{k + 1} \neq {Class}^{k}} \right\}$

[0027] 3. For each partition at a candidate threshold, calculate the following parameters:

[0028] the weighted number of class c samples assigned to LEFT, N_(Lc), and the weighted number of class c samples assigned to RIGHT, N_(Rc). $\begin{matrix} {N_{Lc} = {\sum\limits_{i \in {{Class\_ c}{\_ in}{\_ LEFT}}}^{\quad}\quad w_{i}^{c}}} \\ {N_{Rc} = {\sum\limits_{j \in {{Class\_ c}{\_ in}{\_ RIGHT}}}^{\quad}\quad w_{j}^{c}}} \end{matrix}$

[0029]  Where w_(i)^(c)

[0030]  is the weighting factor for sample i that belongs to class c.

[0031] The total weighted number of samples assigned to LEFT and RIGHT by the partition: $\begin{matrix} {N_{L} = {\sum\limits_{c \in {LEFT}}^{\quad}\quad N_{Lc}}} \\ {N_{R} = {\sum\limits_{c \in {RIGHT}}^{\quad}\quad N_{Rc}}} \end{matrix}$

[0032] Evaluation functions to be used for the partition selection at node n include:

[0033] Purity (Entropy): $\begin{matrix} {{{PR}_{n} = {\sum\limits_{c \in {{all\_ Class}{\_ in}{\_ n}}}^{\quad}\left( {{N_{Lc}\ln \quad P_{Lc}} + {N_{Rc}\ln \quad P_{Rc}}} \right)}}{where}} \\ {P_{Lc} = {{\frac{N_{Lc}}{N_{L}}\quad {and}\quad P_{Rc}} = {\frac{N_{Rc}}{N_{R}}.}}} \end{matrix}$

[0034]  Purity has the maximum value when the training samples are completely separated in LEFT and RIGHT.

[0035] Other criteria that can be used for the evaluation function include the probability of correct classification.

[0036] 4. Select the partition for node n as the one that maximizes the evaluation function.

[0037] 5. Check the following stopping criteria (OR conditions):

[0038] Reached the maximum allowable level of tree: L=log₂N−1 or a user specified limit. Where N is the total number of training samples.

[0039] χ² value is smaller than an allowable limit.

[0040] Where $\chi^{2} = {{\sum\limits_{c \in {{all\_ Class}{\_ in}{\_ n}}}^{\quad}{N_{Lc}\ln \quad P_{Lc}}} + {N_{Rc}\ln \quad P_{Rc}} - {N_{c}^{n}\ln \quad \frac{N_{c}^{n}}{N^{n}}\quad {and}\quad N_{c}^{n}}}$

[0041]  is the weighted number of samples of class c at node n. N^(n) is the total weighted number of samples at node n.

[0042] N^(n) value is smaller than an allowable limit.

[0043] Type I error>limit. Where type I error is the probability that a sample whose true class is in LEFT yet it is classified as RIGHT class.

[0044] Type II error>limit. Where type II error is the probability that a sample whose true class is in RIGHT yet it is classified as LEFT class.

[0045] 6. If none of the stopping criteria is met, assign node n as a non-terminal node and use the step 4 selected partition for this node.

[0046] 7. If at least one of the stopping criteria is met, assign node n as a terminal node, and assign the most probable class from its associated training samples.

[0047] I.3 Smooth Decision Tree Classifier

[0048] A typical decision tree classifier makes crisp decision. That is, it assigns a class unequivocally to an input sample. This method supports discontinuous decision boundaries well and is desirable in classification applications where context switching is required around decision boundaries. However, in applications that require generalization or in applications where the training samples cannot accurately predict decision boundaries or when the input samples are subject to noise and therefore perturb around the decision boundaries, a smooth decision around the decision boundary is desirable. A regulation tree can provide smooth decision boundaries. A regulation tree is disclosed in U.S. patent application Ser. No. 09/972,057, filed Oct. 5, 2001 and entitled “Regulation of Hierarchic Decisions in Intelligent Systems” by Lee, which is incorporated in its entirety herein.

[0049] I.3.1 Regulation Tree Construction

[0050] A regulation tree can be derived from an existing decision tree. The regulation tree has the same structure as the existing decision tree, but it derives and stores additional statistics at each node. The regulation tree construction process inputs a decision tree and a set of training samples. The training samples can be the same training samples used to derive the decision tree, but they do not have to be. The regulation tree construction process includes the following steps:

[0051] 1. For each non-terminal node_(n), determine the distance-to-threshold (d_(i)) values for each training sample i associated with this node. The weighted mean (μ_(d)i) and standard deviation (σ_(di)) for the distance values are derived from the training sample distance values and stored in the node for the classification of new samples. The weighting factors are the weights associated with each training sample. Weights can be associated with samples on a variety of basis such as with the confidence of representation or accuracy of data acquisition, significance to a class determination, or other emphasis criteria. Equal weights can be applied if no additional information is available. A process such as tree focusing can also automatically determine weights. A simple method accumulates the weighted distance value using the following rule:

[0052] Distance(k+1)=Distance(k)+w_(k+1)*d_(k+1)

[0053] Weight(k+1)=Weight(k)+w_(k+1) SquareDistance(k + 1) = SquareDistance(k) + w_(k + 1) * d_(k + 1)²

[0054]  After the accumulation of all training samples associated with the node, the mean distance μ_(d) can be derived by

[0055] μ_(d)=Distance/Weight

[0056]  and the mean square distance s_(d)²

[0057]  can be derived by s_(d)² = SquareDistance/Weight

[0058]  The distance standard deviation σ_(d) value can be derived by $\sigma_{d} = \sqrt{s_{d}^{2} - \mu_{d}^{2}}$

[0059]  To avoid the problem of outliers, an alternative embodiment of the invention can be derived by ranking d_(i) and finding the weighted median value (m_(d)) and the range between the 10% and 90% values of the distance (R_(10%-90%)). The mean distance and the distance standard deviation can be estimated from m_(d) and R_(10%-90%) as follows:

[0060] μ_(d)=m_(d)

[0061] σ_(d)=R_(10%-90%)/2.56

[0062]  Those skilled in the art should recognize that other methods could be used to estimate the mean and standard deviation values. For example, different percentiles can be used to measure the range for the standard deviation estimation. Furthermore, the weights for each sample can all be set equal to one.

[0063] 2. For a terminal node n having N^(n) weighted training samples. Let N_(c)^(n)

[0064]  be the weighted class c training sample count at this terminal node n. The likelihood value for class c at terminal node n can be determined as: L_(class_c)^(n) = N_(c)^(n)/N^(n).

[0065]  An alterative method for likelihood value calculation is: L_(class_c)^(n) = N_(c)^(n)/(N^(n) + β).

[0066]  Where β is a regulation parameter that weakens the likelihood values for terminal nodes having small number of training samples. The likelihood values are stored for each terminal node of the tree.

[0067] I.3.2 Regulation Tree Application

[0068] Given a new sample, X_(input), the likelihood value at each non-terminal node n is determined first. To determine the likelihood value for a non-terminal node, the distance to threshold value is calculated as:

d _(input) =f _(n)(X _(input))−T _(n)

[0069] The likelihood value determination process is shown in FIG. 2. If distance value, d_(input), is zero or negative, the likelihood value for descending through the LEFT branch, L_LEFT, is one in a crisp tree. For purposes of illustration, assume a Gaussian distance probability density function offset according to the mean value for d_(input) and an absolute d_(input) value that is zero or negative. Then, the probability that the sample could descend through the RIGHT branch P_(right) 202 is calculated by $P_{right} = {\int_{- \infty}^{d_{input}}{\frac{1}{\sqrt{2\quad \pi}\sigma_{d}}^{- \frac{{({v - \mu_{d}})}^{2}}{2\quad \sigma_{d}}}{v}}}$

[0070] Where μ_(d) 201 is the mean of the distance probability density and σ_(d) 200 is the standard deviation of the distance probability density.

[0071] The probability of being a sample that should descend through the LEFT branch is calculated as

P _(left)=1−P _(right)

[0072] The likelihood value, L_LEFT, of the regulation tree for descending through the LEFT branch can be calculated as a linear combination of the crisp tree value (i.e. 1) and P_(left) by a regulation parameter α. That is,

L _(left)=0.5+α+(0.5−α)P _(left)

and

L _(right)=1−L _(left)

[0073] If distance value, d_(input), is positive, the likelihood value for descending through the LEFT branch, L_LEFT, and the likelihood value for descending through the RIGHT branch, L_RIGHT can be similarly determined.

[0074] Note that the α value regulates the crisp tree and probabilistic tree. When α=0.5, the tree reverts to the original crisp tree. When α=0, the tree averages the original crisp tree and a complete probabilistic tree with equal weight. When α=−0.5, the tree is a complete probabilistic tree.

[0075] Since a sample (X_(input)) most likely has non-zero branch likelihood values for each of the terminal nodes, the confidence value that corresponds to class c for X_(input), Confidence_(c)(X_(input)), can be determined by the following formula (see FIG. 3): ${{Confidence}_{c}\left( X_{input} \right)} = {\sum\limits_{j \in {terminal\_ nodes}}{\prod\limits_{s \in {{branches\_ to}{\_ j}}}{{L\_ s}\left( X_{input} \right)L_{class\_ c}^{j}}}}$

[0076]FIG. 3 shows the example data for confidence determination diagrammatically for a tree having 3 non-terminal nodes 300, 302, 304 and 4 terminal nodes 306, 308, 310, 312 for classifying input samples into two classes, Class 1 or Class 2. For any input sample X_(input) the likelihood values that it will pass down any branch of the tree can be determined as illustrated. For example, in FIG. 3 the likelihood that it will pass down branch 314 has been determined to be L¹_left(X_(input)). In the FIG. 3 example, these likelihood determinations are labeled for each branch of the tree for the particular input sample. Determine that the new sample X_(input) is in a particular class as: $\begin{matrix} \begin{matrix} {{{Confidence\_ class1}\left( X_{input} \right)} = {{L^{4}{\_ class1}*L^{2}{\_ left}\left( X_{input} \right)*L^{1}{\_ left}\left( X_{input} \right)} +}} \\ {{{L^{5}{\_ class1}*L^{2}{\_ right}\left( X_{input} \right)*L^{1}{\_ left}\left( X_{input} \right)} +}} \\ {{{L^{6}{\_ class1}*L^{3}{\_ left}\left( X_{input} \right)*L^{1}{\_ right}\left( X_{input} \right)} +}} \\ {{L^{7}{\_ class1}*L^{3}{\_ right}\left( X_{input} \right)*L^{1}{\_ right}\left( X_{input} \right)}} \end{matrix} \\ \begin{matrix} {{{Confidence\_ class2}\left( X_{input} \right)} = {{L^{4}{\_ class2}*L^{2}{\_ left}\left( X_{input} \right)*L^{1}{\_ left}\left( X_{input} \right)} +}} \\ {{{L^{5}{\_ class2}*L^{2}{\_ right}\left( X_{input} \right)*L^{1}{\_ left}\left( X_{input} \right)} +}} \\ {{{L^{6}{\_ class2}*L^{3}{\_ left}\left( X_{input} \right)*L^{1}{\_ right}\left( X_{input} \right)} +}} \\ {{L^{7}{\_ class2}*L^{3}{\_ right}\left( X_{input} \right)*L^{1}{\_ right}\left( X_{input} \right)}} \end{matrix} \end{matrix}$

[0077] where the likelihood value for each class is known for each of the terminal nodes and depicted for node 4 (306) as L⁴_Class 1 and L⁴_Class 2, node 5 (308) as L⁵_Class 1 and L⁵_Class 2, node 6 (310) as L⁶_Class 1 and L⁶_Class 2 and node 7 (312) as L⁷_Class 1 and L⁷_Class 2. The associated likelihood values determined for a particular input sample X_(input) that are referred to in the equations above are L¹_left(X_(input)) (314), L¹_right(X_(input)) (416), L²_left(X_(input)) (318), L²_right(X_(input)) (320), L³_left(X_(input)) (322), L³_right(X_(input)) (324).

[0078] The classification process can be performed based upon the confidence determined for each input (Xinput). The classification result, C*, can be determined by the following rule ${C^{*}\left( X_{input} \right)} = {\arg \quad \underset{c}{MAX}{{Confidence}_{c}\left( X_{input} \right)}}$

[0079] II. Decision Regulation Using Global and Population Characteristics

[0080] For a node n in a decision tree, prior art approach uses only N_(c)^(n)

[0081] the weighted class c training sample count at this node n to derive rules for classification or a node effectiveness estimate. The decision regulation approach of this invention uses additional information that characterize the global and population statistics of the training data for classification and node effectiveness estimation. In a preferred embodiment of the invention, up to four types of information are used for each node: local counts, local population statistics, global counts and global population statistics.

[0082] II.1 Global Characteristics and Population Characteristics

[0083] II.1.1 Local Counts

[0084] These include the same information as that of the prior art approach. They consist of N_(c)^(n),

[0085] the weighted class c training sample count at a node n.

[0086] II.1.2 Local Population Statistics

[0087] These include P_(c)^(n),

[0088] the weighted class c training sample proportion at a node n. Where $P_{c}^{n} = \frac{N_{c}^{n}}{\sum\limits_{i \in {{Class\_ c}{\_ in}{\_ all}{\_ training}{\_ samples}}}w_{i}^{c}}$

[0089] In the case that all classes have the same weighted training sample counts, the local counts and local population statistics contain basically the same information. However, when the weighted training sample counts are different for different classes, the P_(c)^(n)

[0090] will have higher relative value for classes with smaller training sample counts. Therefore, local population statistics provide a prevalence independent characterization of the node n. This information could be used to avoid the systematic misclassification of samples from low prevalence classes. This is especially important for correct rare event classification or correctly classifying the classes whose training samples are limited.

[0091] II.1.3 Global Counts

[0092] For each node n except the root node, there exists a parent node p. Let f^(p)(x)≧0 be the decision rule of node p that leads to node n when satisfied. Let G^(n) be the global training sample set associated with node n. The global counts consist of G_(c)^(n)

[0093] the weighted class c training sample count for the samples in G^(n) that satisfy the decision rule f^(p)(x)≧0. In one embodiment of the invention, G^(n) is defined as the training samples that are up to k layers above node n. When k=1, G^(n) includes the training samples in the parent node p, i.e. G^(n)=U^(p). In this case, the global counts are identical to the local counts, that is G_(c)^(n) = N_(c)^(n).

[0094] When k>1, additional samples above the parent node p are included. A larger k includes more global contexts of the node n. When k is sufficiently large, G^(n) can include all training samples as its global context. Therefore the global context coverage can be adjusted using different layer depths.

[0095] Those skilled in the art should recognize that other methods of defining G^(n) can be used in the invention. For example, a minimum number of training samples or a proportion of total samples rather than the layer k can be used to define the global training sample set G^(n).

[0096] II.1.4 Global Population Statistics

[0097] These include g_(c)^(n),

[0098] the weighted global class c training sample proportion at a node n. ${{\,{Where}}\quad g_{c}^{n}} = \frac{G_{c}^{n}}{\sum\limits_{i \in \quad {{Class\_ c}{\_ in}{\_ all}{\_ training}{\_ samples}}}w_{i}^{c}}$

[0099] In the case that all classes have the same weighted training sample counts, the global counts and global population statistics contain basically the same information. However, when the weighted training sample counts are different for different classes, the g_(c) ^(n) will have higher relative value for classes with smaller training sample counts. Therefore, global population statistics provide a prevalence independent global characterization of the node n. This information is used to avoid the systematic misclassification of samples from low prevalence classes.

[0100] II.2 Classification Regulation by Information Integration

[0101] The global and population characteristics of this invention provide a framework for classification decision regulation that discriminates between noise and consistent application characteristics. It also allows a correction for prevalence discrepancy in the training data. In one embodiment of the invention, to regulate classification, a class confidence value is derived from each type of the characteristics for each terminal node. The confidence value for a class c is defined as the ratio between the characteristic value of the class c and that of all classes.

[0102] The local count confidence for class c in a terminal node n is defined as: ${LC}_{c}^{n} = {\frac{N_{c}^{n}}{\sum\limits_{c \in {{All\_ Classes}{\_ in}{\_ n}}}N_{c}^{n}}.}$

[0103] Similarly, the local population confidence for class c in a terminal node n is defined as: ${LP}_{c}^{n} = {\frac{P_{c}^{n}}{\sum\limits_{c \in \quad {{All\_ Classes}{\_ in}{\_ n}}}P_{c}^{n}}.}$

[0104] The global count confidence for class c in a terminal node n is defined as: ${{GC}_{c}^{n} = \frac{G_{c}^{n}}{\sum\limits_{c \in \quad {{All\_ Classes}{\_ in}{\_ n}}}G_{c}^{n}}};$

[0105] and the global population confidence for class c in a terminal node n is defined as: ${GP}_{c}^{n} = {\frac{g_{c}^{n}}{\sum\limits_{c \in \quad {{All\_ Classes}{\_ in}{\_ n}}}g_{c}^{n}}.}$

[0106] In one embodiment of the invention, an integrated confidence value IC_(c)^(n)

[0107] for a class c in a terminal node is defined as a weighted combination of the class c confidence values by the following rule: IC_(c)^(n) = a * LC_(c)^(n) + b * LP_(c)^(n) + c * GC_(c)^(n) + d * GP_(c)^(n)

[0108] Where a, b, c and d are weights for integration. The weights a, b, c and d allow for great flexibility in decision strategy that can be selected to suit an application. When b, c and d are set to 0, the integrated results degenerate to the prior art approach that relies solely on local counts. When a and c are set to 0, a new training class prevalence independent decision strategy is created. When c and d are set to 0, a training class prevalence corrected local based decision strategy is created. Similarly, when a and b are both set to 0, a training class prevalence corrected global based decision strategy is created. Furthermore, the global context coverage can be adjusted using different layer depth k as defined in II.1.3. This decision regulation approach allows the removal (or reduction) of noise from the decision process and integration of local and consistent global information for decisions. Those skilled in the art should recognize that other ways of confidence integration can also be used. For example, a nonlinear combination such as polynomial functions can be used in place of the linear combination.

[0109] In a crisp tree application embodiment of the invention, the regulated class assignment c^(n*) for a terminal node n can be defined as $c^{n^{*}} = {\arg \quad \underset{c}{MAX}\quad {IC}_{c}^{n}}$

[0110] In a smooth tree application embodiment of the invention, IC_(c)^(n)

[0111] can be used as the likelihood value for class c at terminal node n. That is, L_(class_c^(n)) = IC_(c)^(n).

[0112] In one embodiment of the invention, a regulated confidence value corresponding to class c for an input sample X_(input), Confidence_(c)(X_(input)), is determined by: ${{Confidence}_{c}\left( X_{input} \right)} = {\sum\limits_{{j \in {terminal\_ nodes}}\quad}{\prod\limits_{s \in {{branches\_ to}{\_ j}}}{{L\_ s}\left( X_{input} \right){IC}_{class\_ c}^{j}}}}$

[0113] The classification process can be performed based upon the confidence determined for each input (Xinput). The Classification result, C*, can be determined by the following rule ${C^{*}\left( X_{input} \right)} = {\arg \quad \underset{c}{MAX}\quad {{Confidence}_{c}\left( X_{input} \right)}}$

[0114] II.3 Tree Pruning Regulation by Information Integration

[0115] To avoid the over-fitting of data, a decision tree is often pruned (Breiman L., Friedman J. H., Olshen R. A. and Stone C. J., “Classification And Regression Trees”, Chapman & Hall/CRC, 1984 pp 59-62; Quinlan J. R., “C4.5 Programs For Machine Learning”, Morgan Kaufmann, 1993 pp 35-43). Discarding one or more sub-trees and replacing them with terminal nodes usually simplifies decision trees. There are two methods of tree pruning in the prior art approach, cost-complexity pruning and reduced-error pruning. These methods evaluate the error criteria for the samples that fall into a non-terminal node preceding a pair of terminal nodes. If the error criteria result is in favor of the combined nodes, the sub-tree is pruned.

[0116] The following steps can accomplish regulated pruning:

[0117] 1. For each non-terminal node of the tree having two descending terminal nodes,

[0118] a. Determine the accuracy to training samples under the following two conditions:

[0119] i. Consider the two terminal nodes separately and determine the accuracy a1

[0120] ii. Combine the two terminal nodes into one node and determine the accuracy a2

[0121] b. If a1>a2, no pruning of the terminal node pairs

[0122] c. Otherwise, prune the terminal nodes by combing the two terminal nodes and converting the associated non-terminal nodes into one terminal node

[0123] d. If changes occur in the previous iteration, repeat process 1. Otherwise, the pruning process is completed.

[0124] In a preferred embodiment of the invention, the accuracy criteria for tree pruning are regulated using the integrated confidence values as a regulated measure to achieve a good balance between local and global characteristics.

[0125] When two terminal nodes are pruned, they are replaced by their parent node and therefore will inherent all characteristics (local counts, local population statistics, global counts and global population statistics) of the parent node.

[0126] In addition, this information integration invention enables specialized pruning for unreliable nodes. Comparing the local, global, count and population confidences LC_(c)^(n), LP_(c)^(n), GC_(c)^(n), GP_(c)^(n)

[0127] can identify unreliable nodes. In a preferred embodiment of the invention, four confidence ratios are defined: $\frac{{LP}_{c}^{n}}{\left( {{LC}_{c}^{n} + {LP}_{c}^{n}} \right)},\frac{{GC}_{c}^{n}}{\left( {{LC}_{c}^{n} + {GC}_{c}^{n}} \right)},\frac{{GP}_{c}^{n}}{\left( {{LP}_{c}^{n} + {GP}_{c}^{n}} \right)},{\frac{{GP}_{c}^{n}}{\left( {{GC}_{c}^{n} + {GP}_{c}^{n}} \right)}.\quad \frac{{LP}_{c}^{n}}{\left( {{LC}_{c}^{n} + {LP}_{c}^{n}} \right)}}$

[0128] measures the local population effect. If the value is significantly different from 0.5, there is a mismatch between local count and local population based decision. So the results may not be reliable. In the preferred embodiment of the invention, a local population reliability measure R_(LP) is defined as $R_{LP} = \left. {1 - {2*}} \middle| {\frac{{LP}_{c}^{n}}{\left( {{LC}_{c}^{n} + {LP}_{c}^{n}} \right.} - 0.5} \middle| {.\quad \frac{{GC}_{c}^{n}}{\left( {{LC}_{c}^{n} + {GC}_{c}^{n}} \right)}} \right.$

[0129] measures the global and local count difference effect. If the value is significantly different from 0.5, there is a mismatch between the global and local count based decision. So the results may not be reliable. In one embodiment of the invention, a count reliability measure R_(c) is defined as $R_{c} = \left. {1 - {2*}} \middle| {\frac{{GC}_{c}^{n}}{\left( {{LC}_{c}^{n} + {GC}_{c}^{n}} \right)} - 0.5} \middle| \quad {.\frac{{GP}_{c}^{n}}{\left( {{LP}_{c}^{n} + {GP}_{c}^{n}} \right)}} \right.$

[0130] measures the global and local population effect. If the value is significantly different from 0.5, there is a mismatch between global and local population based decisions. So the results may not be reliable. In one embodiment of the invention, a population reliability measure R_(P) is defined as $R_{p} = \left. {1 - {2*}} \middle| {\frac{{GP}_{c}^{n}}{\left( {{LP}_{c}^{n} + {GP}_{c}^{n}} \right)} - 0.5} \middle| \quad {.\frac{{GP}_{c}^{n}}{\left( {{GC}_{c}^{n} + {GP}_{c}^{n}} \right)}} \right.$

[0131] measures the global population effect. If the value is significantly different from 0.5, there is a mismatch between global count and global population based decisions. So the results may not be reliable. In one embodiment of the invention, a global population reliability measure R_(GP) is defined as $R_{GP} = \left. {1 - {2*}} \middle| {\frac{{GP}_{c}^{n}}{\left( {{GC}_{c}^{n} + {GP}_{c}^{n}} \right)} - 0.5} \middle| \quad. \right.$

[0132] In one embodiment of the invention, a combined reliability measure R can be defined as:

R=w _(LP) R _(LP) +w _(c) R _(c) +w _(P) R _(P) +w _(GP) R _(GP)

[0133] Where w_(LP), w_(c), w_(P), w_(GP) are combination weighting factors.

[0134] Those skilled in the art should recognize that other reliability measures and other methods of reliability combination such as nonlinear functions can be used. Some examples are as follows: $\left. {1 - {2*}} \middle| {\frac{{GP}_{c}^{n}}{\left( {{LC}_{c}^{n} + {GP}_{c}^{n}} \right)} - 0.5} \middle| {{{,\quad}1} - {2*}} \middle| {\frac{{GC}_{c}^{n}}{\left( {{LP}_{c}^{n} + {GC}_{c}^{n}} \right)} - 0.5} \middle| \quad. \right.$

[0135] Furthermore, other methods of reliability combination such as non-linear functions can be used in the invention.

[0136] A new tree pruning method is defined in one embodiment of the invention that determines the combined reliability R for the maximum class c of a terminal node n as a regulated measure. Where maximum class c has the highest IC_(c)^(n)

[0137] value among all classes in n. If R increases after combining two terminal nodes, the nodes are combined (therefore, terminal nodes are pruned). In another embodiment of the invention, the reliability R for the maximum class c is integrated with the classification accuracy (a) as the regulated measure (RA) for tree pruning. In one embodiment of the invention, the combination is done by the following rule

RA=w _(R) R+w _(a) a.

[0138] Where w_(R) and w_(a) are weighting factors. Those skilled in the art should recognize that other methods of combination such as nonlinear functions can also be used.

[0139] II.4 Tree Generation Regulation by Information Integration

[0140] A prior art binary decision tree construction procedure is detailed in I.2. The information integration method of this invention can be used in the up-front tree generation process to generate highly robust decision tree classifiers. This is accomplished by using additional information in the partition selection step (step 3 of I.2). In one embodiment of the invention, IC_(c)^(n)

[0141] value for the maximum class c^(n*) detailed in II.2 is used as the evaluation function for the partition selection. In another embodiment of the invention, RA value c^(n*) (detailed in II.3) is used as the evaluation function for the partition selection.

[0142] Those skilled in the art should recognize that the embodiments described above are not exhaustive, and that other criteria and weight determination derived from additional information can be used as the evaluation function for the partition selection in the decision tree construction process.

[0143] The invention has been described herein in considerable detail in order to comply with the Patent Statutes and to provide those skilled in the art with the information needed to apply the novel principles and to construct and use such specialized components as are required. However, it is to be understood that the inventions can be carried out by specifically different weighting, confidence determination, and accuracy assessment processes, and that various modifications, both as to the method details and selection procedures, can be accomplished without departing from the scope of the invention itself. 

What is claimed is:
 1. A method for collecting global or population characteristics for decision tree regulation comprises the following steps: (a) Input a decision tree; (b) Input a set of training samples; (c) Use the training samples to determine a decision characteristic for at least one decision tree node, said decision characteristic selected from the group consisting of global characteristics and population characteristics.
 2. The method of claim 1 wherein the decision characteristic compensates for unequal class prevalence in the training samples.
 3. The method of claim 1 wherein the decision characteristic compensates for errors in the training data.
 4. The method of claim 1 wherein the global characteristics include global counts.
 5. The method of claim 1 wherein the global characteristics include global population statistic.
 6. The method of claim 1 wherein the population characteristics include local population statistic.
 7. A method for classification regulation by information integration comprises the following steps: (a) Input a decision tree; (b) Input a plurality of decision characteristics selected from the group consisting of global characteristics and population characteristics from at least one terminal node of the decision tree; (c) Determine the confidence value for each of the plurality of said decision characteristics (d) Determine an integrated confidence value for each class of said at least one terminal node.
 8. For a crisp tree application, the method of claim 7 further assigns the class with the maximum integrated confidence value as the decision for the terminal node.
 9. For a smooth tree application the method of claim 7 further uses the integrated confidence value as the likelihood value.
 10. The method of claim 7 wherein the global characteristics and population characteristics are selected from the group consisting of global counts, local counts, global population statistic, and local population statistic.
 11. The method of claim 7 wherein the confidence value is selected from the set consisting of local count confidence, local population confidence, global count confidence and global population confidence.
 12. The method of claim 7 wherein the integrated confidence value is a weighted combination of a plurality of confidence values.
 13. The method of claim 7 wherein the global characteristics have a global context coverage that is adjusted using different layer depths.
 14. The method of claim 7 wherein the global characteristics have a global context coverage that is adjusted on a minimum number of training samples.
 15. A method for tree pruning regulation by information integration comprises the following steps: (a) Input a decision tree; (b) Input a set of training samples; (c) Generate a regulated measure selected from the group consisting of integrated confidence values and reliability measures; (d) For a non-terminal node of the tree having two descending terminal nodes, determine the accuracy values using the regulated measure under two separate nodes or combined node conditions; (e) If combined node accuracy value is greater than the two separate node accuracy value, prune the terminal nodes by combing the two terminal nodes and convert the associated non-terminal nodes into one terminal node.
 16. The method of claim 15 wherein the reliability measures include a local population reliability measure.
 17. The method of claim 15 wherein the reliability measures include a count reliability measure.
 18. The method of claim 15 wherein the reliability measures include a population reliability measure.
 19. The method of claim 15 wherein the reliability measures include a combined reliability measure.
 20. The method of claim 15 wherein the reliability measures include a global population reliability measure.
 21. The method of claim 15 wherein the reliability measures include a combined reliability measure.
 22. The method of claim 15 wherein the reliability measure for the maximum class is integrated with the classification accuracy as the criteria for tree pruning
 23. A method for tree generation regulation by information integration comprises the following steps (a) Input a set of training samples; (b) For at least one node, generate a set of candidate thresholds; (c) Partition data at a candidate threshold; (d) Calculate an evaluation function selected from the set consisting of integrated confidence value and reliability measures; (e) Select the partition for the node as the one that maximizes the evaluation function. 